Energy-Constrained Software Prefetching Optimization

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Energy-Constrained Prefetching Optimization in Embedded Applications

In energy-constrained settings, most low-power compiler optimization techniques take the approach of minimizing the energy consumption while meeting no performance loss. However, it is possible that the available energy budget is not sufficient to meet the optimal performance objective. To limit energy consumption within a given energy budget, energy-constrained optimization approach is more si...

متن کامل

SPG: Software for Convex-Constrained Optimization

Fortran 77 software implementing the SPG method is introduced. SPG is a nonmonotone projected gradient algorithm for solving largescale convex-constrained optimization problems. It combines the classical projected gradient method with the spectral gradient choice of steplength and a nonmonotone line search strategy. The user provides objective function and gradient values, and projections onto ...

متن کامل

Benchmarking of bound-constrained optimization software

In this report we describe a comparison of different algorithms for solving nonlinear optimization problems with simple bounds on the variables. Moreover, we would like to come out with an assessment of the optimization library DOT used in the optimization suite OPTALIA at Airbus for this kind of problems.

متن کامل

Energy-constrained modulation optimization for coded systems

We consider radio applications where the nodes operate on batteries so that energy consumption must be minimized while satisfying given throughput and delay requirements. In this context, we analyze the best modulation strategy to minimize the total energy consumption required to send a given number of bits when error-control codes are used. The total energy consumption includes both the transm...

متن کامل

Tuning Subdivision Algorithms Using Constrained Energy Optimization

In this paper a method is presented to fair the limit surface of a subdivision algorithm around an extraordinary point. The eigenvalues and eigenvectors of the subdivision matrix determine the continuity and shape of the limit surface. The dominant, sub-dominant and subsub-dominant eigenvalues should satisfy linear and quadratic equalityand inequality-constraints to guarantee continuous normal ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Software

سال: 2006

ISSN: 1000-9825

DOI: 10.1360/jos171650